A HYBRID ALGORITHM FOR SYNTHESIZING LINEAR SPARSE ARRAYS
نویسندگان
چکیده
منابع مشابه
Worst-Case Tolerance Synthesis for Low-Sidelobe Sparse Linear Arrays Using a Novel Self-Adaptive Hybrid Differential Evolution Algorithm
A worst-case tolerance synthesis problem for low-sidelobe sparse linear arrays is solved by using a novel self-adaptive hybrid differential evolution (SAHDE) algorithm. First, we establish a worstcase tolerance synthesis model for low-sidelobe sparse linear arrays, in which random position errors are considered and assumed to obey the Gaussian distributions. Through the random sampling, the ran...
متن کاملA hybrid algorithm for computing permanents of sparse matrices
The permanent of matrices has wide applications in many fields of science and engineering. It is, however, a #P-complete problem in counting. The best-known algorithm for computing the permanent, which is due to Ryser [Combinatorial Mathematics, The Carus Mathematical Monographs, vol. 14, Mathematical Association of America, Washington, DC, 1963], runs O(n2 ) in time. It is possible to speed up...
متن کاملDifferential Evolutionary Algorithm for Synthesizing Sum and Difference Pattern in Linear Antenna Arrays with Reduced Design Cost of Feed Network
In this work a new approach to synthesize sum and difference pattern in the radiation pattern of linear antenna arrays is proposed. To reduce the design cost of the feed network of the array for the desired array pattern, only part of the radiating elements are excited non-uniformly whereas the remaining elements are excited uniformly at constant amplitude. The work is illustrated with a 30 ele...
متن کاملLearning hybrid linear models via sparse recovery
We introduce new methods to tackle the problem of hybrid linear learning—learning the number and dimensions of the subspaces present in a collection of high-dimensional data and then determining a basis or overcomplete dictionary that spans each of the subspaces. To do this, we pose this problem as the estimation of a set of points on the Grassmanian manifold G(k, n), i.e., the collection of al...
متن کاملHybrid Sparse Linear Solutions with Substituted Factorization
We develop a computationally less expensive alternative to the direct solution of a large sparse symmetric positive definite system arising from the numerical solution of elliptic partial differential equation models. Our method, substituted factorization , replaces the computationally expensive factorization of certain dense submatrices that arise in the course of direct solution with sparse C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress In Electromagnetics Research C
سال: 2016
ISSN: 1937-8718
DOI: 10.2528/pierc16030304